package com.shuzijun.leetcode.editor.cn;

import com.sun.org.apache.regexp.internal.RE;

public class ConvertIntegerLcci{
    public static void main(String[] args) {
         Solution solution = new ConvertIntegerLcci().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int convertInteger(int A, int B) {
        int C = A^B;
        int count = 0;
        for (int i = 0; i < 32; i++) {
            if ((C&1) == 1) {
                count++;
            }
            C >>=1;
        }
        return count;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}